n,m=map(int,input().split())
val=input()
keys=val.split()
u=input()
fp=u.split()
for i in range(n):
if(keys[i] in fp):
print(keys[i],end=" ")#include<bits/stdc++.h>
using namespace std;
int main(){
int n,m,i,j,a[10001],b[10001];
cin>>n>>m;
for(i=0;i<n;i++){
cin>>a[i];
}
for(i=0;i<m;i++){
cin>>b[i];
}
vector<int>v;
for(i=0;i<n;i++){
for(j=0;j<m;j++){
if(a[i]==b[j]){
v.push_back(a[i]);
}
}
}
for(i=0;i<v.size();i++){
cout<<v[i]<<" ";
}
return 0;
}
1516A - Tit for Tat | 622. Design Circular Queue |
814. Binary Tree Pruning | 791. Custom Sort String |
787. Cheapest Flights Within K Stops | 779. K-th Symbol in Grammar |
701. Insert into a Binary Search Tree | 429. N-ary Tree Level Order Traversal |
739. Daily Temperatures | 647. Palindromic Substrings |
583. Delete Operation for Two Strings | 518. Coin Change 2 |
516. Longest Palindromic Subsequence | 468. Validate IP Address |
450. Delete Node in a BST | 445. Add Two Numbers II |
442. Find All Duplicates in an Array | 437. Path Sum III |
436. Find Right Interval | 435. Non-overlapping Intervals |
406. Queue Reconstruction by Height | 380. Insert Delete GetRandom O(1) |
332. Reconstruct Itinerary | 368. Largest Divisible Subset |
377. Combination Sum IV | 322. Coin Change |
307. Range Sum Query - Mutable | 287. Find the Duplicate Number |
279. Perfect Squares | 275. H-Index II |